A General Lagrange Theorem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Hahn–Banach–Lagrange theorem

The idea behind this article is to provide a unified and relatively nontechnical framework for treating the main existence theorems for continuous linear functionals in functional analysis, convex analysis, Lagrange multiplier theory, and minimax theory. While many of the results in this article are already known, our approach is new, and gives a large number of results with considerable econom...

متن کامل

A More General Version of the Costa Theorem

In accordance with the Costa theorem, the interference which is independent of the channel input and known non-causally at the transmitter, does not affect the capacity of the Gaussian channel. In some applications, the known interference depends on the input and hence has some information. In this paper, we study the channel with input dependent interference and prove a capacity theorem that n...

متن کامل

The Lagrange Theorem for Multidimensional Diophantine Approximation

In this paper we give a necessary and sufficient condition for z in the floor of the Poincaré half-space to have periodicity in the multidimensional Diophantine approximation by convergents using the Hermite algorithm. We examine in detail the structure of the corresponding sequences and give some examples

متن کامل

Lagrange ' S Theorem with N " 3 Squares

For every N > I we construct a set A of squares such that JA < (4/log 2)N 1 / 3 log N and every nonnegative integer n < N is a sum of four squares belonging to A . Let A be an increasing sequence of nonnegative integers and let A(x) denote the number of elements of A not exceeding x. If every nonnegative integer up to x is a sum of four elements of A, then A(x)4 > x and so A(x) > x 1/4. In 1770...

متن کامل

Converse Lagrange Theorem Orders and Supersolvable Orders

For finite groups, we investigate both converse Lagrange theorem (CLT) orders and supersolvable (SS) orders, and see that the latter form a proper subset of the former. We focus on the difference between these two sets of orders, reformulate the work of earlier authors algorithmically, and construct a computer program to enumerate such NSS-CLT orders. We establish several results relating to NS...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: American Mathematical Monthly

سال: 2009

ISSN: 0002-9890,1930-0972

DOI: 10.4169/193009709x469823